International Conference on Parallel Processing ' 93 1 Processor Allocation and Scheduling of Macro Data
نویسنده
چکیده
Functional or Control parallelism is an eeective way to increase speedups in Multicomputers. Programs for these machines are represented by Macro Dataaow Graphs (MDGs) for the purpose of functional parallelism analysis and exploitation. Algorithms for allocation and scheduling of MDGs have been discussed along with some analysis of their optimality. These algorithms attempt to minimize the execution time of any given MDG through exploitation of functional parallelism. Our preliminary results show their eeectiveness over naive algorithms.
منابع مشابه
A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملEvaluation of scheduling solutions in parallel processing using DEA FDH model
This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.
متن کاملSimultaneous Allocation and Scheduling Using Convex Programming Techniques
Simultaneous exploitation of task and data parallelism provides signiicant beneets for many applications. The basic approach for exploiting task and data parallelism is to use a task graph representation (Macro Dataaow Graph) for programs to decide on the degree of data parallelism to be used for each task (allocation) and an execution order for the tasks (scheduling). Previously, we presented ...
متن کاملMulti - Processor Mapping
The problem of scheduling a set of tasks to a set of processors can be divided into two categories: job scheduling and scheduling and mapping. In the former category, independent jobs are to be scheduled among the processors of a distributed computing system to optimize overall system performance [1][2]. In contrast, the scheduling and mapping problem requires the allocation of multiple interac...
متن کاملAnalysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors
In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macro-dataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms and classify them into four groups. The first group includes algorithms that schedule the DAG to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993